Adaptive Bayesian algorithm for achieving a desired magneto-sensitive transition

نویسندگان

چکیده

Bayesian methods which utilize Bayes' theorem to update the knowledge of desired parameters after each measurement, are used in a wide range quantum science. For various applications science, efficiently and accurately determining transition frequency is essential. However, exact relation between controllable experimental usually absent. Here, we propose an efficient scheme search suitable conditions for via adaptive algorithm, experimentally demonstrate it by using coherent population trapping ensemble laser-cooled $^{87}$Rb atoms. The controlled external magnetic field, can be tuned realtime applying d.c. voltage. Through voltage automatically converge one from random initial value only few iterations. In particular, when target applied nonlinear, our algorithm shows significant advantages over traditional methods. This work provides simple way determine frequency, widely fields precision spectroscopy, such as atomic clocks, magnetometers, nuclear resonance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new adaptive GMRES algorithm for achieving high accuracy

GMRES(k) is widely used for solving nonsymmetric linear systems. However, it is inadequate either when it converges only for k close to the problem size or when numerical error in the modified Gram–Schmidt process used in the GMRES orthogonalization phase dramatically affects the algorithm performance. An adaptive version of GMRES(k) which tunes the restart value k based on criteria estimating ...

متن کامل

Towards an Adaptive RED Algorithm for Achieving Delay-Loss Performance

Random Early Detection (RED) [1] is an active queue management strategy that has been deployed extensively in routers. However, its effectiveness has been limited owing to the difficulty in tuning its parameters under different network conditions. In this paper, we define the notion of an operating point that an Active Queue Management (AQM) policy should target. We suggest that the RED paramet...

متن کامل

A Bayesian adaptive basis algorithm for single particle reconstruction.

Traditional single particle reconstruction methods use either the Fourier or the delta function basis to represent the particle density map. This paper proposes a more flexible algorithm that adaptively chooses the basis based on the data. Because the basis adapts to the data, the reconstruction resolution and signal-to-noise ratio (SNR) is improved compared to a reconstruction with a fixed bas...

متن کامل

Desired Compensation Adaptive Robust Control

A desired compensation adaptive robust control (DCARC) framework is presented for nonlinear systems having both parametric uncertainties and uncertain nonlinearities. The paper first considers a class of higher order nonlinear systems transformable to a normal form with matched model uncertainties. For this class of uncertain systems, the desired values of all states for tracking a known desire...

متن کامل

A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optics Express

سال: 2021

ISSN: ['1094-4087']

DOI: https://doi.org/10.1364/oe.431334